منابع مشابه
Program Derivation by Fixed Point Computation
Thrs paper develops a transformational paradrgm by which nonnumertcal algorrthms are treated as fixed pomt computatrons derived from very htgh level problem specrficatrons We begin by presenting an abstract functronal problem specrficatron language SQ’, which 1s shown to express any partial recursive function m a fixed pomt normal form Next, we gtce a nondetermuusttc Iterative schema that rn th...
متن کاملPDDL 2.1: Representation vs. Computation
I comment on the PDDL 2.1 language and its use in the planning competition, focusing on the choices made for accommodating time and concurrency. I also discuss some methodological issues that have to do with the move toward more expressive planning languages and the balance needed in planning research between semantics and computation.
متن کاملReversible Computation vs. Reversibility in Petri Nets
Petri nets are a general formal model of concurrent systems which supports both action-based and state-based modelling and reasoning. One of important behavioural properties investigated in the context of Petri nets has been reversibility, understood as the possibility of returning to the initial marking from any reachable net marking. Thus reversibility in Petri nets is a global property. Reve...
متن کاملDerivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f (X) is equal to the least fixed-point of a linear system obtained by “linearizing” the polynomials of f in a certain way. Our proofs rely on derivation tree analysis, a proof principle that combines methods from algebra, calculus, and formal language theory, and was first use...
متن کاملComputation of Determinant vs. Permanent A Survey
The Determinant vs. Permanent problem has been of particular interest as it gives an example of an “easy” problem, which under some seemingly insignificant alteration becomes vastly more difficult to solve. In sections 2 and 3 I will discuss and prove theorems regarding the complexity of each problem. In section 4 I explore some important combinatorial interpretations of determinant and permane...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1994
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)90068-x